Oblivious Printing of Secret Messages in a Multi-party Setting
نویسندگان
چکیده
We propose oblivious printing, a novel approach to document printing in which a set of printers can cooperate to print a secret message—in human or machine readable form—without learning the message. We present multi-party protocols for obliviously printing a secret in three settings: obliviously printing the contents of a ciphertext, obliviously printing a randomized message, and generating and obliviously printing a DSA/Elgamal keypair. We propose an approach to improving the legibility of messages in the presence of numerous participants. Finally we propose some potential applications of oblivious printing in the context of electronic voting and digital cash.
منابع مشابه
Efficient Secure Two-Party Exponentiation
We present a new framework to design secure two-party computation protocols for exponentiation over integers and over ZQ where Q is a publicly-known prime. Using our framework, we realize efficient protocols in the semi-honest setting. Assuming the base is non-zero, and the exponent is at most Q/2 for the ZQ case, our protocols consist of at most 5 rounds (each party sending 5 messages) and the...
متن کاملk out of n Oblivious Transfer Protocols from Bilinear Pairings
Two non-interactive three parties k out of n oblivious transfer protocols k n OT (where 0<k<n) from bilinear pairings are proposed in this paper. In these protocols, a sender can obliviously transfer n messages to a receiver without communication with him/her. The public keys that a sender used to encrypt his/her messages are made by a third party. The receiver can extract k out of n messages a...
متن کاملLeakage Resilient Secure Two-Party Computation
In the traditional secure function evaluation setting, some set of distrusting parties jointly compute a function of their respective inputs securely as if the computation is executed in an ideal setting where the parties send inputs to a trusted party that performs the computation and returns its result. Almost independently of secure computation, the area of leakage resilient cryptography has...
متن کاملOn the Message Complexity of Secure Multiparty Computation
We study the minimal number of point-to-point messages required for general secure multiparty computation (MPC) in the setting of computational security against semi-honest, static adversaries who may corrupt an arbitrary number of parties. We show that for functionalities that take inputs from n parties and deliver outputs to k parties, 2n+k−3 messages are necessary and sufficient. The negativ...
متن کاملFrom Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting
AES block cipher is an important cryptographic primitive with many applications. In this work, we describe how to efficiently implement the AES-128 block cipher in the multiparty setting where the key and the plaintext are both in a secret-shared form. In particular, we study several approaches for AES S-box substitution based on oblivious table lookup and circuit evaluation. Given this secure ...
متن کامل